1991A - Maximize the Last Element - CodeForces Solution


greedy implementation

Please click on ads to support us..

Python Code:

import io,os

input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

t = int(input())

def inp():
    return int(input())
def inlt():
    return list(map(int,input().split()))
def instr():
    return list(input())

for _ in range(t):
    n = inp()
    a = inlt()

    maxe = 0
    for i in range(0,len(a),2):
        maxe = max(maxe,a[i])
    
    print(maxe)


Comments

Submit
0 Comments
More Questions

349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera